On minimal constraint networks
نویسندگان
چکیده
منابع مشابه
On Minimal Constraint Networks
In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. The tractability or intractability of computing a solution to such a minimal network was a long standing open question. Dechter conjectured this computation problem to be NP-hard. We prove this conjecture. We also prove a conjecture by Dechter and Pearl stating that for k ≥ 2 it is NP-har...
متن کاملOn Binary Constraint Networks
It is well-known that general constraint satisfaction problems (CSPs) may be reduced to the binary case (BCSPs) Pei92]. CSPs may be represented by binary constraint networks (BCNs), which can be represented by a graph with nodes for variables for which values are to be found in the domain of interest, and edges labelled with binary relations between the values, which constrain the choice of sol...
متن کاملMinimal Logical Constraint Covering Sets
We propose a general framework for computing minimal set covers under class of certain logical constraints. The underlying idea is to transform the problem into a mathematical programm under linear constraints. In this sense it can be seen as a natural extension of the vector quantization algorithm proposed by [5]. We show which class of logical constraints can be cast and relaxed into linear c...
متن کاملOn the Minimal Constraint Satisfaction Problem: Complexity and Generation
The Minimal Constraint Satisfaction Problem, or Minimal CSP for short, arises in a number of real-world applications, most notably in constraint-based product configuration. Despite its very permissive structure, it is NP-hard, even when bounding the size of the domains by d ≥ 9. Yet very little is known about the Minimal CSP beyond that. Our contribution through this paper is twofold. Firstly,...
متن کاملCONSTRAINT Networks
1 Introduction Constraint-based reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satised. A variety of techniques have been developed for nding partial or complete solutions for dierent kinds of constraint expressions. These have been successfully applied to diverse tasks such as design, diagnosis, truth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2012
ISSN: 0004-3702
DOI: 10.1016/j.artint.2012.07.006